How Reliable Are Practical Point-in-Polygon Strategies?
نویسنده
چکیده
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. However, our experiments reveal that the tested code often fails for more challenging degenerate and also nearly degenerate queries.
منابع مشابه
Calculations of Dihedral Groups Using Circular Indexation
In this work, a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$. Each element of the sequence represents a vertex of the polygon. Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis. Here each symmetry is considered as a system that takes an input circular sequence and g...
متن کاملToward Reliable Polygon Set Operations
Polygon intersection (clipping) and difference are among the most fundamental operations in computer graphics. To the uninitiated, these problems appear trivial; in fact, they are extremely difficult to perform reliably by computer. Although the graphics literature already provides algorithms for polygon set operations, they have two significant weaknesses: (1) they may fail because they are sp...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملEvaluation of urban branding strategies in Iranian cities
Urban branding, as a new approach toward urban development, improves marketing of the city image in different ways by changing the visual image of the city into a brand image. This paper aims to survey the element of urban branding strategies in Iranian cities by examining the criteria of urban branding theory in Iranian cities. The main goal of this investigation is to describe how the cities ...
متن کاملEfficient Angle Summation Algorithm for Point Inclusion Test and Its Robustness
A winding angle summation approach to the point-in-polygon problem is considered. The winding angle summation is backward stable and resistant to possible gaps between subsequent edges. A precomputed bounding volume hierarchy can be used to accelerate point queries for winding angle summation. The main theorem states that a BVH-accelerated point query takes no longer than O ( K log n K ) time i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008